\

  • Comparison-Based Algorithms for sorting arrays are
  • The number of leaves in a decision tree corresponds to the number of options you have in the output of your algorithm.
  • Any comparison based algorithm where we get to throw away half of the outputs we can use a decision tree. Normally we will be told which to use.